Minimal (max,+) Realization of Convex Sequences∗
نویسنده
چکیده
We show that the minimal dimension of a linear realization over the (max,+) semiring of a convex sequence is equal to the minimal size of a decomposition of the sequence as a supremum of discrete affine maps. The minimal-dimensional realization of any convex realizable sequence can thus be found in linear time. The result is based on a bound in terms of minors of the Hankel matrix.
منابع مشابه
On the boolean minimal realization problem in the max-plus algebra
The max-plus algebra is one of the frameworks that can be used to model discrete event systems. One of the open problems in the max-plus-algebraic system theory for discrete event systems is the minimal realization problem. In this paper we present some results for a simplified version of the general minimal realization problem: the boolean minimal realization problem, i.e., we consider models ...
متن کاملOn the Complexity Ofthe Boolean Minimalrealization Problem
One of the open problems in the max-plus-algebraic system theory for discrete event systems is the minimal realization problem. We consider a simpliied version of the general minimal realization problem: the boolean minimal realization problem, i.e., we consider models in which the entries of the system matrices are either equal to the max-plus-algebraic zero element or to the max-plus-algebrai...
متن کاملDetermining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form
A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...
متن کاملOn the complexity of the boolean minimal realization problem in the max-plus algebra∗
One of the open problems in the max-plus-algebraic system theory for discrete event systems is the minimal realization problem. We consider a simplified version of the general minimal realization problem: the boolean minimal realization problem, i.e., we consider models in which the entries of the system matrices are either equal to the max-plus-algebraic zero element or to the maxplus-algebrai...
متن کاملThe minimal realization problem in the max-plus algebra
The minimal realization problem in the max-plus algebra, " Chapter 32 in Open Problems in Mathematical Systems and Control Theory
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997